Method and/or system for tagging trees

ABSTRACT

Embodiments of methods and/or systems for tagging trees are disclosed.

This disclosure claims priority pursuant to 35 USC 119(e) from U.S.provisional patent application Ser. No. 60/623,352, filed on Oct. 29,2004, by J. J. LeTourneau, titled, “METHOD AND/OR SYSTEM FOR TAGGINGTREES,” assigned to the assignee of the presently claimed subjectmatter.

BACKGROUND

This disclosure is related to navigating trees.

In a variety of fields, data or a set of data, may be represented in ahierarchical fashion. This form of representation may, for example,convey information, such as particular relationships or patterns betweenparticular pieces of data or groups of data and the like. However,manipulating and/or even recognizing specific data representations orpatterns is not straight-forward, particularly where the data isarranged in a complex hierarchy. Without loss of generality, examplesmay include a database, and further, without limitation, a relationaldatabase. Techniques for performing operations on such databases orrecognizing specific patterns, for example, are computationally complex,time consuming, and/or otherwise cumbersome. A need, therefore,continues to exist for improved techniques for performing suchoperations and/or recognizing such patterns.

BRIEF DESCRIPTION OF THE DRAWINGS

Subject matter is particularly pointed out and distinctly claimed in theconcluding portion of the specification. The claimed subject matter,however, both as to organization and method of operation, together withobjects, features, and advantages thereof, may best be understood byreference of the following detailed description when read with theaccompanying drawings in which:

FIG. 1 is a schematic diagram of embodiments of several unorderededge-labeled trees and symbolic expressions mathematically representingthe tree embodiments;

FIG. 2 is a schematic diagram of embodiments of several unorderededge-labeled trees and symbolic expressions mathematically representingthe tree embodiments;

FIG. 3 is a schematic diagram of embodiments of several unorderededge-labeled trees and symbolic expressions mathematically representingthe tree embodiments;

FIG. 4 is a schematic diagram illustrating an embodiment of an unorderededge-labeled tree and a symbolic expression mathematically representingthe tree embodiment;

FIG. 5 is a schematic diagram illustrating all N-valued rooted,unordered edge-labeled trees, where N is a natural numeral greater thanor equal to 2;

FIG. 6 is a table providing an embodiment of a function that relatesnatural numerals to composite numerals;

FIG. 7 is a table providing symbolic expressions for an embodiment ofrooted, unordered, 2-valued edge-labeled trees;

FIG. 8 is a table providing symbolic expressions for an embodiment ofrooted, unordered, 3-valued edge-labeled trees;

FIG. 9 is a table providing symbolic expressions for an embodiment ofrooted, unordered, 4-valued edge-labeled trees;

FIG. 10 is a table providing symbolic expressions for an embodiment ofrooted, unordered, 5-valued edge-labeled trees;

FIG. 11 is a table providing symbolic expressions for an embodiment ofrooted, unordered, 6-valued edge-labeled trees;

FIGS. 12 and 13 provide an embodiment of a table relating the naturalnumerals and embodiments of different tree views;

FIG. 14 is a schematic diagram of an unordered node labeled tree;

FIG. 15 is a schematic diagram of an unordered edge labeled tree;

FIG. 16 is a table illustrating an embodiment of a relationship betweenBELTs and natural numerals;

FIG. 17 is a schematic diagram illustrating an embodiment of merging twoedge-labeled trees;

FIG. 18 is a table illustrating an embodiment of a set of rules tocovert natural numerals to strings;

FIG. 19 is a table illustrating an embodiment of an association betweennatural numerals and a set of strings;

FIGS. 20-24 are a sequence of operations illustrating a technique toimplement one embodiment of a method of tagging a tree; and

FIGS. 25-28 are a sequence of operations illustrating a technique toimplement another embodiment of a method of tagging a tree.

DETAILED DESCRIPTION

In the following detailed description, numerous specific details are setforth to provide a thorough understanding of the claimed subject matter.However, it will be understood by those skilled in the art that theclaimed subject matter may be practiced without these specific details.In other instances, well-known methods, procedures, components and/orcircuits have not been described in detail so as not to obscure theclaimed subject matter.

Some portions of the detailed description which follow are presented interms of algorithms and/or symbolic representations of operations ondata bits or binary digital signals stored within a computing system,such as within a computer or computing system memory. These algorithmicdescriptions and/or representations are the techniques used by those ofordinary skill in the data processing arts to convey the substance oftheir work to others skilled in the art. An algorithm is here, andgenerally, considered to be a self-consistent sequence of operationsand/or similar processing leading to a desired result. The operationsand/or processing involve physical manipulations of physical quantities.Typically, although not necessarily, these quantities may take the formof electrical and/or magnetic signals capable of being stored,transferred, combined, compared and/or otherwise manipulated. It hasproven convenient, at times, principally for reasons of common usage, torefer to these signals as bits, data, values, elements, symbols,characters, terms, numbers, numerals and/or the like. It should beunderstood, however, that all of these and similar terms are to beassociated with the appropriate physical quantities and are merelyconvenient labels. Unless specifically stated otherwise, as apparentfrom the following discussion, it is appreciated that throughout thisspecification discussions utilizing terms such as “processing”,“computing”, “calculating”, “determining” and/or the like refer to theactions and/or processes of a computing platform, such as a computer ora similar electronic computing device, that manipulates and/ortransforms data represented as physical electronic and/or magneticquantities and/or other physical quantities within the computingplatform's processors, memories, registers, and/or other informationstorage, transmission, and/or display devices.

In a variety of fields, data or a set of data, may be represented in ahierarchical fashion. This form of representation may, for example,convey information, such as particular relationships or patterns betweenparticular pieces of data or groups of data and the like. However,manipulating and/or even recognizing specific data representations orpatterns is not straight-forward, particularly where the data isarranged in a complex hierarchy. Without loss of generality, examplesmay include a database and further, without limitation, a relationaldatabase. Techniques for performing operations on such databases orrecognizing specific patterns, for example, are computationally complex,time consuming, and/or otherwise cumbersome. A need, therefore,continues to exist for improved techniques for performing suchoperations and/or recognizing such patterns.

As previously discussed, in a variety of fields, it is convenient and/ordesirable to represent data, a set of data and/or other information in ahierarchical fashion. In this context, such a hierarchy of data shall bereferred to as a “tree.” In a particular embodiment, a tree may comprisea finite, rooted, connected, acyclic graph. Likewise, such trees may beeither ordered or unordered. Here, ordered refers to the notion thatthere is an ordering or precedence among nodes attached to a common nodecorresponding to the order of the attached nodes shown in a graphicalillustration. An unordered tree, is illustrated here, for example, inFIG. 15 by embodiment 100. As illustrated, the root of this particularembodiment encompasses node 105. In addition to 105, there are eightother nodes designated 110 to 145, respectively. Likewise, the nodes areconnected by branches referred to, in this context, as edges. Thus, thenodes of this tree are connected by eight edges. This embodiment,therefore, illustrates a finite tree that is rooted by node 105.Furthermore, the nodes are connected, meaning, in this context, that apath exists between any two nodes of the tree. The tree is likewiseacyclic, meaning here, that no path in the tree forms a complete loop.

As previously suggested, in a variety of contexts, it may be convenientand/or desirable to represent a hierarchy of data and/or otherinformation using a structure, such as the embodiment illustrated inFIG. 15. One particular embodiment, without loss of generality, of atree may include edges that are labeled with data and/or other values.Likewise, in one particular embodiment, such data and/or values may belimited to a particular set of data. For example, in this context, abinary edge labeled tree refers to a tree in which the data and/orvalues comprise binary data, that is, in this example, either a binaryone or a binary zero. Likewise, alternatively, the edges of a tree maybe labeled with three values, such as 0, 1, 2. Continuing, the edges maybe labeled with four values, five values, etc. In this context, theclass of all trees in which the edges are labeled with a specific numberof distinct values, that is, in this context, values chosen from a sethaving a specific number of distinct elements, shall be referred to asedge-labeled trees (ELTs). It is likewise noted that such trees are notlimited to being labeled with the numerals previously described. Anydistinctly identifiable labels may be employed; however, in thiscontext, it shall be understood that employing numerals to label theedges is sufficiently general to encompass any sort of data labels thatmay be desirable, regardless of their form.

To reiterate, in this context, a tree comprises an edge labeled tree ifeach edge of the string or tree respectively stores a value or singlepiece of data. Likewise, in this context, two nodes are employed tosupport an edge holding a single piece of data. At this point, it isworth noting that trees having nodes and edges, such as previouslydescribed, may be represented in a computing platform or similarcomputing device through a data structure or a similar mechanismintended to capture the hierarchical relationship of the data, forexample. It is intended that all such embodiments are included withinthe scope of the claimed subject matter.

It is noted that binary edge labeled trees (BELTs) may be listed orenumerated. See, for example, U.S. provisional patent application Ser.No. 60/543,371, titled “Manipulating Sets of Hierarchical Data,” filedon Feb. 9, 2004, by J. J. LeTourneau, and assigned to the assignee ofthe current provisional application. This is illustrated, here, forexample, in FIG. 16. It is noted that this particular figure alsoincludes the associated natural numerals. The association of suchnumerals for this particular embodiment should be clear based at leastin part on previously cited U.S. provisional patent application Ser. No.60/543,371. However, it is, of course, again noted that the claimedsubject matter is not limited in scope to employing the approach orapproaches described in aforementioned U.S. provisional patentapplication Ser. No. 60/543,371. U.S. provisional patent applicationSer. No. 60/543,371 is provided simply as an example of listing orenumerating unordered BELTs.

However, for this particular embodiment, although the claimed subjectmatter is not limited in scope in this respect, a method of enumeratinga set of unordered trees may begin with enumeration of an empty binaryedge labeled tree and a one node binary edge labeled tree. Thus, theempty tree is associated with the natural numeral zero and has asymbolic representation as illustrated in FIG. 16 (circle). Likewise,the one node tree, which holds no data, is associated with the naturalnumeral one and has a graphical representation of a single node. Forhigher positive natural numbers, ordered trees may be generated by aprocess described, for example, in “The Lexicographic Generation ofOrdered Trees,” by S. Zaks, The Journal of Theoretical Computer Science,Vol. 10(1), pp 63-82, 1980, or, “Enumerating Ordered TreesLexicographically,” by M. C. Er, Computation Journal, Vol. 28, Issue 5,pp 538-542, 1985. This may be illustrated, for example in FIG. 16, asdescribed in more detail below.

As illustrated, for this particular embodiment, and as previouslydescribed, the empty tree has zero nodes and is associated with thenatural numeral zero. Likewise, the one node tree root comprises asingle node and is associated with the natural numeral one. Thus, toobtain the tree at position two, a root node is attached and connectedto the prior root node by an edge. Likewise, here, by convention, theedge is labeled with a binary zero. If, however, the tree formed by theimmediately proceeding approach were present in the prior enumeration oftrees, then a similar process embodiment is followed, but, instead, thenew edge is labeled with a binary one rather than a binary zero. Thus,for example, to obtain the binary edge labeled tree for position three,a new root node is connected to the root node by an edge and that edgeis labeled with a binary one.

Continuing with this example, to obtain the binary edge labeled tree forposition four, observe that numeral four is the product of numeral twotimes numeral two. Thus, a union is formed at the root of two trees,where, here, each of those trees is associated with the positive naturalnumeral two. Likewise, to obtain the binary edge labeled tree forposition five, begin with the binary edge labeled tree for position twoand follow the previously articulated approach of adding a root and anedge and labeling it with a binary zero.

In this context, adding a root node and an edge and labeling it binaryzero is referred to as a “zero-push” operation and adding a root nodeand an edge and labeling it binary one is referred to as a “one-push”operation. Thus, referring again to FIG. 16, the one-push of the roottree is the tree at position three. This follows from FIG. 9 ofpreviously referenced U.S. provisional patent application Ser. No.60/543,371, since Q((1*2)−1)=Q(1)=3. Likewise, the tree at position fiveis the zero-push of the tree at position 2. Again, this follows fromFIG. 9 of the previously referenced US provisional patent application,since Q((2*2)−2)=Q(2)=5.

In the embodiment just described, binary edge labeled trees use binarynumerals “0” and “1.” However, the claimed subject matter is not limitedin scope to binary edge labeled trees. For example, trees may employ anynumber of numeral combinations as labels, such as triplets, quadruplets,etc. Thus, using a quadruplet example, it is possible to constructtrees, such as a zero-push of a particular tree, a one-push of thattree, a two-push of that tree, and a three-push of that tree. Thus, forsuch trees, edges may be labeled 0, 1, 2 or 3, etc., as previouslydescribed and as explained in more detail hereinafter.

The foregoing discussion has begun to characterize an algebra involvingtrees, in this particular embodiment, an algebra for unordered edgelabeled trees or unordered ELTs, such as BELTs. The foregoing discussiondefines a value zero, a zero node tree for this particular embodiment, avalue one, a one node tree for this particular embodiment, and a monadicoperation, previously described as zero-push. For example,alternatively, a “one-push” may be employed. For this embodiment, thisis analogous, for example, to the convention that “0” represent “off”and “1” represent “on.” Alternatively and equivalently, “1” may beemployed to represent “off,” and “0” may be employed to represent “on,”without loss of generality. For this particular embodiment, anadditional operation may be characterized, a “merger” operation. Themerger operation with respect to trees refers to merging two trees attheir roots. This operation is illustrated, for example, in FIG. 17.

As will now be appreciated, the merger operation comprises a binaryoperator. Likewise, the constants zero/one, referred to above, may beviewed as an operation having no argument or as a zero valued argumentoperator or operation. Thus, this operation, in effect, returns the samevalue whenever applied. Here, for this particular embodiment, theconstant value, or zero valued argument operation that returns “c” andis denoted as “c.” The merger operator is denoted as “*”.

FIG. 4 is schematic diagram illustrating an embodiment of an edgelabeled tree, here a 4 valued edge labeled tree. In this particularembodiment, four distinct values are employed to label the edges. Here,the labels comprising A, B, C and D, although, of course, the claimedsubject matter is not limited to 4 valued edge labeled trees, to edgelabeled trees, or to employing these particular edge labels. It is notedthat the labels A, B, C, and D in this embodiment are similar to thelabels binary 0 and binary 1 for BELTs. Below tree 400 is a symbolicexpression mathematically representing tree 400. Performing theoperations indicated by the expression shown in FIG. 4 below tree 400will provide a natural numeral that corresponds, for this particularembodiment, to this particular tree, as described in more detailhereinafter.

To assist in understanding the relationship between the symbolicexpression shown in FIG. 4 and tree 400, for this particular embodiment,FIG. 1 provides an embodiment 110 of another tree. As illustrated, tree110 comprises an edge label D connecting two nodes. For this particularcontext, this embodiment may be expressed symbolically as follows: D(1).Thus, a technique to describe the embodiment of tree 110 would refer tothe “push” of the natural number 1. Here, for this particularembodiment, this particular push operation comprises the “D” push of 1,resulting in D being the label of the edge connecting the two nodes.More specifically, as previously described, a single node comprises thenatural numeral 1 in this particular embodiment. To perform a pushoperation, an edge is attached to that node and labeled. Here, applyinga D push, the label provided comprises the label D.

Continuing, the “C” push of “1” is illustrated as two nodes with an edgelabeled C connecting the two nodes for tree embodiment 120. Applyingsimilar reasoning provides an edge labeled tree embodiment 130representing the following expression: B(C(1)). Likewise, for thisparticular embodiment, the operation of merger may be represented as“*”, as previously suggested. Thus, applying a merger operation providestree embodiment 140 at the bottom of FIG. 1 corresponding, for thisparticular embodiment, to the following expression: (D(1)*B(C(1))).Applying similar reasoning to FIGS. 2 and 3 and the tree embodimentsshown ultimately produces tree 400 illustrated in FIG. 4, along with thecorresponding symbolic expression.

As the previous discussion suggests, here A, B, C and D comprise monadicoperators and the merger operation comprises a binary operation. In U.S.provisional patent application No. 60/575,784, titled “Method and/orSystem for Simplifying Tree Expressions, such as for Pattern Matching,”filed May 28, 2004, by J. J. LeTourneau, assigned to the assignee of thecurrent application, monadic operators similar to those described herewere designed as successor operators, using the symbol S(x). Here, thesemonadic operators comprise multiple successive operators.

Previously, an embodiment for manipulating binary edge labeled trees orBELTs was described in connection with U.S. provisional patentapplication 60/543,371. In that context, binary edge labeled treescomprise finite rooted, unordered two valued edge labeled trees. Thus,for the particular embodiment of binary edge labeled trees described,the two values comprise “0” and “1,” although alternately they couldcomprise A and B, for example, or any other two values. Referring now toFIG. 5, a Venn diagram 500 is illustrated providing the set of all edgelabeled trees, structured or organized in a particular manner here. Inthe center of the diagram, binary or two valued edge labeled trees aredepicted as a subset. Furthermore, as illustrated, two valued edgelabeled trees are also depicted as a subclass or subset of three valuededge labeled trees. Likewise, three valued edge labeled trees aredepicted as a subclass or subset of four valued edge labeled trees andso forth. Thus, depending at least in part on the particular set ofdistinct values employed to label the edges, an edge labeled tree thatemploys two distinct values may comprise an example of a three valuededge labeled tree in which one of the values is specifically notemployed in the particular tree. As shall be explained in more detailhereinafter, this raises a question regarding proper interpretation ofthe data that the tree may represent or store. More specifically, anidentical tree may represent different data depending at least in parton whether the tree is “viewed” as, to continue with this example, a twovalued edge labeled tree or a three valued edge labeled tree. Thus, inthis embodiment, we refer to this as the “view” of the particular tree.For example, a two valued edge labeled tree is referred to as view 2 anda three valued edge labeled tree is referred to as view 3, although, forexample, the particular tree may not contain three different values. Theview in this embodiment refers to the set of distinct values from whichthe labels may be selected, as previously described. FIG. 5 thereforedepicts the set of all edge labeled trees as the union of all such edgelabeled trees in which the edge values are selected from a set having aspecific number of distinct values.

Previously in U.S. provisional application 60/543,371, an embodiment wasdemonstrated in which an association existed between natural numeralsand binary edge labeled trees. For this particular embodiment, similarassociations also exist, here between any N valued edge labeled tree andthe natural numerals, where N is a numeral. Of course, many differentassociations are possible and the claimed subject matter is intended tocover all such associations regardless of the particular embodiment.Thus, for example, three valued edge label trees may be converted tonumerals, four valued edge labeled trees may be converted to numeralsand so forth. Thus, manipulations, such as those previously described,for example, in aforementioned provisional U.S. patent application60/543,371, as well as additional manipulations, may be applied to Nvalued edge labeled trees, as described in more detail hereinafter.

As suggested in previously referenced U.S. provisional application60/543,371, in one particular embodiment, when converting between binaryedge labeled trees and numerals, a relationship was found to existbetween a “push” operation and non-composite numerals. Thus, in thiscontext, it may be convenient to define an operation indexed by thenatural numerals that provides in ascending order the non-compositenumerals, although, of course, the claimed subject matter is not limitedin scope in this respect. Such an operation is depicted specifically inFIG. 6. As described in more detail hereinafter, this operation is alsoconvenient in this context in connection with edge labeled trees of anynumber of distinct edge values.

As previously suggested in aforementioned U.S. provisional patentapplication No. 60/575,784, a set of congruence operations on the set oftree expressions may be isomorphic to the set of finite, rooted,unordered binary edge labeled trees. Thus, or more particularly, undersuch an isomorphism, in the particular embodiment, a one-to-onerelationship between the equivalence classes that satisfy the treeexpressions and the finite, rooted, ordered binary edge labeled treesmay exist.

Thus, beginning with binary edge labeled trees or finite rootedunordered two valued edge labeled trees, but continuing to edge labeledtrees of higher numbers of values, such as, for example, three valuededge labeled trees, four valued edge labeled trees and so forth, forthis embodiment, a similar association or relationship between treeexpressions and edge labeled trees may be constructed. Thus, for thisembodiment, with a set of operations that satisfies a set of treeexpressions an isomorphism with a set of finite routed unordered Nvalued edge labeled trees results in a similar one to one relationshipbetween the equivalence classes that satisfy the tree expressions andthe edge labeled trees themselves. Likewise, by demonstrating that thesetree expressions are also isomorphic with natural numerals, treemanipulations are able to be constructed for edge labeled trees usingnatural numerals, as had similarly been done for binary edge labeledtrees. Thus, as shall become more clear hereinafter, manipulating treeexpressions is isomorphic to manipulating numerals for this particularembodiment.

Previously, binary edge labeled trees have been discussed. For purposesof illustration, it shall instructive to now discuss another type ofedge labeled tree, such as four valued edge labeled trees. For example,FIG. 9 corresponds to finite rooted unordered four valued edge labeledtrees, which were also discussed previously with respect to FIG. 4.Thus, for this example embodiment, an algebra may be constructed that isisomorphic to the natural numerals for such four valued edge labeledtrees. Likewise, similar algebras may be constructed by use a similarset of tree expressions, as shown, for example, by FIGS. 7, 8, 10 and11. The similarity of these expressions allows us to write a schema orgeneralized description and thereby cover all such similar algebras.

Thus, similar to an approach previously described, FIG. 9 provides a setof constants and operators here, constants 0 and 1, monadic operators A,B, C, and D and binary operator *. Thus, we designate this algebra withthe signature <2,4,1> as a result. The expressions for this particularembodiment are provided in FIG. 9. The first expression, 910, denotescommunitivity and the second expression, 920, denotes associativity.Likewise, the next two expressions, 930, define the relationship of themerger of the constants with any other value. The next four expressions,940, define the monadic operators A, B, C and D.

Thus, for this embodiment, these expressions therefore define a set ofedge labeled trees with particular properties. Specifically, theproperties are isomorphic to the natural numerals. Thus, as shall bedemonstrated further, for this embodiment, four valued edge labeledtrees, for example, may be manipulated using natural numerals.

At least in part because natural numerals are isomorphic to N valuedtrees, a way to depict this relationship for this embodiment isillustrated by FIGS. 12 and 13. Previously, a particular view for aparticular edge labeled tree, for this embodiment, was discussed. Inthese figures, each column represents a different potential view for aset of edge labeled trees for this embodiment. Likewise, each rowprovides the edge labeled tree in the view corresponding to the columnfor the natural number on the left-hand side of FIG. 12.

For example, column one shows the trees with for two valued edge labeledtrees edges, otherwise referred to as binary edge labeled trees. Thus,as previously described, no nodes corresponds to “0”. Continuing, asingle node corresponds to “1” or to “root”. Likewise, the numerals twoand three in this view turn out to be push operations. In this case, thenumeral 2 is the tree corresponding to the A push of one denoted A(1).Likewise, the numeral 3 is the tree corresponding to the B push of one,denoted B(1).

For this embodiment, these relationships may also be confirmed byreferring back to FIG. 7. Here, the operations A(x) and B(x) as definedin terms of the function, previously defined in connection with FIG. 6.Thus, using these expressions, to determine the push of 1 denoted A(1),as provided in FIG. 7, this is Q((2*1)−2). This provides Q(0) or thevalue 2, as demonstrated from FIG. 6. As similar result may be obtainedfor B(1). Referring to FIG. 7, this corresponds to Q((2*1)−1), or Q(1),again from FIG. 6, the value 3.

A similar relationship may be established for three valued edge labeledtrees, described by the expressions provided in FIG. 8, for example.Referring again to FIGS. 12 and 13, the edge labeled trees correspondingto these expressions are depicted in the second column. It is noted thatthe tree structures using this notation are the same between the firstcolumn and the second column for the numerals from zero to four.However, a difference is noted between the first column and the secondcolumn at numeral 5. Thus, for view 3, the numeral 5 is the C push of 1.More particularly, again referring to FIG. 8, C(1) equals Q(3*1)−1), orQ(2). From FIG. 6, the corresponding value is 5, as previouslysuggested. Similarly, looking at column 3 of FIG. 12, for view 5, the Dpush of 1 is numeral 7.

Thus, for this embodiment, regardless of the “view” of the edge labeledtrees, there is a unique one to one correspondence, here, an associationembodiment, between the natural numerals and that set of edge labeledtrees. This embodiment, therefore, provides the capability to manipulateand combine edge labeled trees of different view. For example, for twoedge labeled trees from two different views, one of the edge labeledtrees may be converted so that the two edge labeled trees are in thesame view. Once in the same view, the trees may be manipulated, such asby a merger, for example. Likewise, in an alternative embodiment, bothtrees may be converted to numerals, the numerals may be manipulated andthen the manipulated numerals may be converted back to edge labeledtrees of a particular view. Likewise, the edge labeled trees may beconverted to any desirable view.

It is likewise noted that for this particular embodiment one way ofmanipulation an edge labeled tree is to apply a push operation to theedge labeled tree. Likewise, as previously described, for thisembodiment, a push operation comprises adding an edge and labeling it.Assuming for this embodiment that the labels for the edge labeled treecomprise numerals, the label for a particular view will be a numeralthat is less than the view itself. For example if the view is 5 than theset of distinct values to label an edge comprises 0, 1, 2, 3 or 4. Ofcourse, this is merely one potential embodiment and the claimed subjectmatter is not limited in scope in this respect. For example, aspreviously described, letters may be employed. Likewise, any set ofvalues where each value is distinct may be employed and remain withinthe scope of the claimed subject matter.

A similar set of manipulations may be applied to node labeled treesrather than edge labeled trees. Thus, node labeled trees may berepresented in different views, may be converted to the same view, maybe converted to numerals, combined, and converted back to a node labeledtree of a particular view. Likewise, a push operation may be applied toa node labeled tree, as previously described for edge labeled trees.

Although the claimed subject matter is not limited in scope in thisrespect, one technique for implementing this approach may be to apply atable look up approach. For example, a table providing differentembodiments associating different views to natural numerals may beemployed. Of course, the claimed subject matter is not limited in scopein this respect. For example, instead, a table look-up may be employedfor the operation Q and the expressions previously described may beapplied to perform manipulations, such as those previously illustrated,for example.

Techniques for performing table look-ups are well-known andwell-understood. Thus, this will not be discussed in detail here.However, it shall be appreciated that any and all of the previouslydescribed and/or later described processing, operations, conversions,transformations, manipulations, etc. of strings, trees, numerals, data,etc. may be performed on one or more computing platforms or similarcomputing devices, such as those that may include a memory to store atable as just described, although, the claimed subject matter is notnecessarily limited in scope to this particular approach. Thus, forexample, a hierarchy of data, such as a tree as previously described,for example, may be formed. Likewise, operations and/or manipulations,as described, may be performed; however, operations and/or manipulationsin addition to those described or instead of those described may also beapplied. It is intended that the claimed subject matter cover suchembodiments.

As described in prior embodiments, one technique for manipulating edgelabeled trees includes converting such trees to natural numerals,performing manipulation of the natural numerals, and converting back toan edge labeled tree of a particular view. Furthermore, as describedabove, one technique for such conversions may include table look-up, asdescribed above. Likewise, in another embodiment, it may be possible toconvert a natural numeral directly to an edge labeled tree using a tablelook-up for the operation Q, previously described. For example, if itwere desirable to convert the natural numeral 61 to an edge labeled treein view 4, the numeral could be factored and the factors converted totrees. In this example, 61 is a non-composite, so, using a tablelook-up, Q(17) provides 61. Thus, 61 is a push of 17. Using theexpressions provided on FIG. 9, for example, we may determine whether 61is the A, B, C, or D push of 17, and so forth. Likewise, for thisparticular embodiment, previously, an example of converting between anedge labeled tree of a particular view and a natural numeral wasprovided.

As previously described an embodiment in accordance with the claimedsubject matter may include edge labeled trees of a distinct number ofpotential identifying labels N, N being a natural numeral. Likewise, aspreviously described, an example of an embodiment of such a tree is 400illustrated in FIG. 4. Likewise, by employing the symbolic expressionbelow tree 400 in FIG. 4, as previously described, for this embodiment,it is possible to convert this particular tree, which we previouslydescribed as a tree of view 4, into a natural numeral. By thismechanism, for this particular embodiment, it is possible to performtree manipulations by manipulating natural numerals. Likewise, for thisparticular embodiment, edge label trees may be converted to strings andmanipulation of such strings may provide tree manipulations as well, asdescribed in more detail hereinafter.

For example, in this embodiment, FIG. 19 provides an embodiment of anassociation between natural numerals, on the left-hand side, and a setof strings, on the right-hand side. Of course, as has been previouslyindicated, the claimed subject matter is not limited in scope to thisparticular association embodiment and many other association embodimentsare included within the scope of the claimed subject matter.Nonetheless, there are aspects of this particular embodiment worthy offurther discussion. For example, FIG. 18 provides a set of rules thatpermit conversion between the natural numerals and this particularassociation embodiment of strings. Again, it is noted that the claimedsubject matter is not limited in scope to this particular embodiment.However, as shall be discussed in more detail hereinafter, a feature ofthis particular embodiment is the ability to represent push operationsand merger operations, such as those previously described in connectionwith edge labeled trees, using strings.

FIG. 18 provides for this embodiment a set of rules for convertingnatural numerals to strings. As illustrated, and as is similar to theapproach previously employed in conjunction with edge labeled trees, thenumeral 0 is assigned an empty string, whereas the numeral 1 is assigneda pair of corresponding left-right brackets. This is indicated byexpressions 1810. It is likewise noted that in this context we includethe numeral zero when referring to the natural numerals. Likewise, as isillustrated by expression 1820 in FIG. 18, a numeral that is two timesthe numeral X is represented as the string for X plus an extra set ofleft-right brackets in front of the brackets for the numeral X.Likewise, expression 1830, denoted the odd non-composite rule, issimilar in concept to a push operation, previously described inconnection with edge labeled trees. If a natural numeral is anon-composite numeral, it is assigned the string for the natural numberindex of that non-composite, as defined by the operation shown in FIG. 6but then surrounded by an additional left-hand bracket on the left-handside and an additional right hand bracket on the right-hand side, asdepicted in FIG. 18. Further, expression 1840 comprises the merger rulein which the multiplication of two natural numbers is simply thecombination of the strings for those natural numbers represented side byside or adjacent to one another. It is further noted, although theclaimed subject matter is not limited in scope in this respect, that aconvention may be introduced to ensure that a unique association existsbetween particular numerals and strings. For example, one suchconvention may be that the smaller of the two numerals is the string onthe left, for example, although, the claimed subject matter is notlimited in scope to such a particular approach. From these rules, it ispossible to construct the strings shown in FIG. 19 that correspond withthe natural numbers. Again, it is noted that this is a particularassociation embodiment and the claimed subject matter is not limited inscope in this respect. Thus any one of a number of other rules forconstructing strings might have been employed and remain within thescope of the claimed subject matter.

A feature of this embodiment, although the claimed subject matter is notlimited in scope in this respect, is that the strings shown in FIG. 19may likewise be associated with unitary edge labeled trees, that is,strings that employ a single unitary label for all of the edges of thetree. To be more specific, the set of distinct values from which labelsfor edges are chosen is a set of one value only. Alternatively, suchtrees need not have their edges labeled with any value, similar inrespects, to the strings themselves. Thus, as described previously inwhich an edge labeled tree of a particular view may be converted to anatural numeral for manipulation purposes; likewise, such an edgelabeled tree may be converted to, for example, for this particularembodiment, a string corresponding the edge labeled tree and the stringmay be manipulated in place of manipulating a natural numeral.

Thus, this particular embodiment provides an approach in which edgelabeled trees may be manipulated by converting between different views,as previously described. Likewise, edge labeled trees may be manipulatedby converting to natural numerals, manipulating the natural numerals,and converting back to edge labeled trees of a particular view.Furthermore, edge labeled trees may be manipulated by converting tocorresponding strings, manipulating the strings, and then convertingback to edge labeled trees. It is noted that the claimed subject matteris not limited to these particular approaches or to employing any one ofthese approaches alone. The desirability of the approach will depend atleast in part and vary with a variety of factors, including storagecapabilities, processing capabilities, the particular application andthe like.

A related issue in connection with embodiments of edge labeled trees,such as those previously described, for example, is the ability totraverse or navigate such edge labeled trees. In particular, it mayprove desirable to traverse or navigate such trees, for example, withoutnecessarily traversing every edge and/or node of the particular tree.However, techniques known for navigating or traversing trees, as ageneral principle, involve traversing or navigating all the nodes and/oredges of the tree or at least substantial portions that it might bedesirable to avoid due to the limitations of time, resources, processingcapability or the like. See, for example, Discrete Mathematics inComputer Science, D. F. Stanat and D. F. McAllister, Prentice-Hall,1977, Section 3.2, “Tree Traversal Algorithms,” p. 140.

Therefore, as shall become more clear hereinafter, it may be desirableto have a technique for identifying specific edges and/or nodes of anedge labeled tree out of all the edges and/or nodes of the tree. Onesuch approach is referred to in this context as tagging the particularedge and/or nodes. By tagging edges and/or nodes, it may be possible tospecify a route or provide a mechanism for navigating around portions ofthe tree without traversing every node and/or edge. Likewise, as shallbecome more clear, tagging may also provide the ability to specify theorder in which those nodes and/or edges are to be traversed.

Without intending to limit the scope of the claimed subject matter, thedesirability of having such capabilities might arise in a number ofdifferent situations. For example, in connection with a data basesystem, for example, it may be desirable to locate specific data quicklywithout traversing the entire tree structure or nearly the entirestructure of the data base. Alternatively, in a commercial process thatmay structured or represented as a tree and implemented by computingdevice, for example, it may be desirable to skip a portion of the treeto reach another node or edge at another point in the process,depending, for example, at least in part upon what has occurred in theprocess to that point in time. Again, these are simply examples and manyother examples in which the ability to traverse nodes and/or edges of atree in a specified order and to traverse only those nodes and/or edgesmay prove desirable.

In accordance with one embodiment of the claimed subject matter, amethod of traversing an edge labeled tree may include locating specificnodes of the tree that are to be traversed. For example, referring toFIG. 4, assuming tree 400 comprise an edge labeled tree in which it isdesirable to traverse specific nodes, FIG. 20 provides anotherrepresentation of tree 400 in which specific nodes are designated to betraversed and, likewise, the desired order of traversal is alsoprovided.

In this particular embodiment, the nodes of the tree that are to betraversed shall each have a corresponding tag. Such tags, in thisparticular embodiment, for example, are capable of being identified by acomputing device that has been suitable programmed. Thus, the tags shallin essence, for this embodiment, become incorporated into the treestructure, as shall be described in more detail hereinafter.

For this specific embodiment, creation of a tag may be illustrated byFIGS. 21 to 24. For example, referring to FIG. 21, for the nodes to betraversed, an edge labeled B is attached and another node is providedsupporting that edge labeled B. Again, it is noted that the claimedsubject matter is not limited in scope to this particular embodiment.For example, here, the label B was selected due at least in part to thestructure of this particular tree, although, alternatively a differentlabel may have been employed. For example, a label that has not beenemployed in the tree, such as E, for example, might have been employed.Nonetheless, continuing with our example in FIG. 22, sub-trees areattached to the “new” nodes where the sub-trees, in this particularembodiment, are intended to designate the order in which the particularnodes of the initial tree are to be traversed. Thus, for example, fromthe node designated by the natural numeral 0, an empty sub-tree has beenprovided. In contrast, a sub-tree corresponding to 1 has been employedto tag the node designated by the natural numeral 1. Likewise, asub-tree corresponding to the natural numeral 2 has been employed to tagthe node having the natural numeral 2 and so forth.

At this point, it is to be noted, for this particular embodiment, thatthere is a correspondence between the sub-trees employed in FIG. 22 andthe strings depicted in FIG. 19, although this is a particularembodiment and the claimed subject matter is not necessarily limited inscope in this respec. More specifically, depending upon the particularembodiment, it may be appropriate to employ tags to designate theparticular nodes to be traversed in which the tags comprised strings.Those strings may then be converted to sub-trees. To be more specific,for this particular embodiment, the strings denoted in FIG. 19 may beconverted to unitary valued trees, as previously described. Thus, thestrings may be converted to trees in which the edges are labeled with asingle value. For example, a correspondence exists and is apparent byinspection between the sub-tree for the natural numeral 2 in FIG. 22 andthe string for the natural numeral 2 in FIG. 19. Likewise, thecorrespondence for natural numeral 3 between FIG. 22 and FIG. 19 islikewise apparent by inspection. Thus, the strings provide a mechanismfor providing sub-trees that may operate as tags in which the tags maybe identified by labeling the edges with a value that either is notemployed in the tree elsewhere or a value that is not repeated in thetree so that it is clear which portions of the tree comprise tags andwhich portions of the tree do not comprise tags.

Comparing FIGS. 22, 23, and 24, it is now apparent how a tree may beconstructed in which incorporated into the tree is informationspecifying the traversal of specific nodes, including the order in whichthose nodes are to be traversed. More specifically, when the treeillustrated in FIG. 24, for example, is stored, the sub-trees below eachnode are likewise stored, such as in a table for easy access, althoughthe claimed subject matter is not limited in scope in this respect.Thus, the ability to pick those sub-trees that correspond to tag fromthose that do not is capable of being implemented based at least in parton the edge labels. To rephrase, the tags that are incorporated into thetree, such as the tree in FIG. 24, in this embodiment operate aspointers to the specific nodes to be traversed and also provideinformation regarding the order in which the nodes are to be traversed.

Yet another aspect of this particular embodiment, although, again theclaimed subject matter is not limited in scope in, this respect is thatedge labeled trees that have been tagged in a particular view, such asin the manner previously described, for example, may be converted tonatural numerals and/or strings, manipulated, and converted back totrees of the particular view without affecting the tags that have beenincorporated into the tree. For example, if two trees in a particularview have tags indicating that the nodes of those trees are to betraversed in a specific order, those trees may be converted to naturalnumerals or to strings, manipulated, such as by merger, and convertedback to a tree of the particular view. Yet, in the resulting tree, thetags and ordering shall remain intact. A reason this is possible relatesto the underlying nature of the structure of the views, as previouslydescribed. For example, referring to view 4 and FIG. 9, as previouslydiscussed, the edge labeled trees may be related to an algebra involvingpush and merger operations. From the isomorphism between the edgelabeled trees of the particular view, here 4, and the natural numerals,the operations do not result in the particular operand trees from losingtheir inherent association for this embodiment. Thus, the operand treesthat produce the resulting tree may always be recovered in an analogousmanner that composite numerals may always be factored, for example.

FIGS. 25-28 illustrate an alternate embodiment to the one justdescribed. Of course, the claimed subject matter is not limited to theseembodiments. Many more are possible and are included within the scope ofthe claimed subject matter. However, for this particular embodiment,rather than employing tags that correspond to a particular naturalnumeral, here, the tags employed correspond to the index of thenon-composite numerals that correspond to the factorization of theparticular numeral providing the order to traverse the nodes. Forexample, in this embodiment, to double the particular numeral, as ingoing from the numeral 1 to the numeral 2, an additional labeled edge isadded from the particular node. Likewise, similarly, a labeled edge isadded in going from numeral 2 to numeral 4. For example, the label forthe edges may comprise B, as previously, although the claimed subjectmatter is not limited in scope in this respect. However, for anon-composite numeral, a push operation is applied. Therefore, thenumeral 3 is the push of the numeral 1. Of course, this is merely oneparticular embodiment and the claimed subject matter is not limited inscope in this respect.

Embodiments of a method of manipulating tree expressions have a varietyof potentially useful applications. As described previously, treesprovide a technique for structuring and/or depicting hierarchical data.Thus, for example, trees may be employed to represent language sentencestructures, computer programs, algebraic formulae, molecular structures,family relationships and more. For example, one potential application ofsuch a tree reduction technique is in the area of pattern matching See,for example, “A VLSI Architecture for Object Recognition using TreeMatching” K. Sitaraman, N. Ranganathan and A. Ejnioui; Proceedings ofthe IEEE International Conference on Application-Specific Systems,Architectures, and Processors (ASAP '02) 2000; “Expressive and efficientpattern languages for tree-structured data” by Frank Neven and ThomasSchwentick; Proceedings of the Nineteenth ACM SIGACT-SIGMOD-SIGARTSymposium on Principles of Database Systems, May 2000. Thus, in patternmatching, substructures, in the form of a tree, for example, may belocated within a larger structure, also in the form of a tree, referredto in this context as the target. This may be accomplished by comparingthe structures; however, typically, such a comparison is complex,cumbersome, and/or time consuming.

Of course, the claimed subject matter is not limited to unordered edgelabeled trees. For example, as described in previously cited U.S.provisional patent application 60/543,371, binary edge labeled trees andbinary node labeled trees may be employed nearly interchangeably torepresent substantially the same hierarchy of data. In particular, abinary node labeled tree may be associated with a binary edge labeledtree where the nodes of the binary node labeled tree take the samevalues as the edges of the binary edge labeled tree, except that theroot node of the binary node labeled tree may comprise a node having azero value or a null value. Thus, rather than employing edge labeledtrees (ELTs), the previously described embodiments may alternatively beperformed using node labeled trees (NLTs). One example of a NLT isillustrated in the diagram of FIG. 14 by tree 1400. As one exampleembodiment, operations and/or manipulations may be employed using edgelabeled trees and the resulting edge labeled tree may be converted to anode labeled tree. However, in another embodiment, operations and/ormanipulations may be performed directly using node labeled trees.

In accordance with the claimed subject matter, therefore, any tree,regardless of whether it is edge labeled, node labeled, non-binary, afeature tree, or otherwise, may be manipulated and/or operated upon in amanner similar to the approach of the previously described embodiments.Typically, different views shall be employed, depending at least inpart, for example, upon the particular type of tree. Furthermore oralternatively, as described in the previously referenced U.S.provisional patent application 60/543,371, a node labeled tree in whichthe nodes are labeled with natural numerals or data values may beconverted to an edge labeled tree. Furthermore, this may be accomplishedwith approximately the same amount of storage. For example, for thisparticular embodiment, this may involve substantially the same amount ofnode and/or edge data label values. However, for convenience, withoutintending to limit the scope of the claimed subject matter in any way,here, operations and/or manipulations and the like have been describedprimarily in the context of ELTs.

In another embodiment, however, a particular tree may include null typesor, more particularly, some node values denoted by the empty set. Anadvantage of employing null types includes the ability to address abroader array of hierarchical data sets. For example, without loss ofgenerality and not intending to limit the scope of the claimed subjectmatter in any way, a null type permits representing in a database or arelational database, as two examples, situations where a particularattribute does not exist. As may be appreciated, this is different froma situation, for example, where a particular attribute may take on anumeral value of zero. Again, as described in the previously referencedU.S. provisional patent application 60/543,371, a tree with nulls, asdescribed above, may be converted to a tree without nulls; however, theclaimed subject matter is not limited in scope in this respect, ofcourse. Thus, it may be desirable to be able to address both situationswhen representing, operating upon, manipulating and/or searching forpatterns regarding hierarchical sets of data.

Likewise, in an alternative embodiment, a node labeled tree, forexample, may comprise fixed length tuples of numerals. For such anembodiment, such multiple numerals may be combined into a singlenumeral, such as by employing Cantor pairing operations, for example.See, for example, Logical Number Theory, An Introduction, by CraigSmorynski, pp, 14-23, available from Springer-Verlag, 1991. Thisapproach should produce a tree to which the previously describedembodiments may then be applied.

Furthermore, a tree in which both the nodes and the edges are labeledmay be referred to in this context as a feature tree and may beconverted to an edge labeled tree and/or a node labeled tree. Forexample, without intending to limit the scope of the claimed subjectmatter, in one approach, a feature tree may be converted by convertingany labeled node with its labeled outgoing edge to an ordered pair oflabels for the particular node.

In yet another embodiment, for trees in which data labels do notcomprise simply natural numerals, such as, as one example, trees thatinclude negative numerals, such data labels may be converted to anordered pair of numerals. For example, the first numeral may represent adata type. Examples include a data type such as negative, dollars, etc.As described above, such trees may also be converted to edge labeledtrees, for example. However, again, this is provided for purposes ofexplanation and illustration. The claimed subject matter is not limitedin scope to employing the approach of the previously referencedprovisional patent application.

It will, of course, be understood that, although particular embodimentshave just been described, the claimed subject matter is not limited inscope to a particular embodiment or implementation. For example, oneembodiment may be in hardware, such as implemented to operate on adevice or combination of devices, for example, whereas anotherembodiment may be in software. Likewise, an embodiment may beimplemented in firmware, or as any combination of hardware, software,and/or firmware, for example. Likewise, although the claimed subjectmatter is not limited in scope in this respect, one embodiment maycomprise one or more articles, such as a storage medium or storagemedia. This storage media, such as, one or more CD-ROMs and/or disks,for example, may have stored thereon instructions, that when executed bya system, such as a computer system, computing platform, or othersystem, for example, may result in an embodiment of a method inaccordance with the claimed subject matter being executed, such as oneof the embodiments previously described, for example. As one potentialexample, a computing platform may include one or more processing unitsor processors, one or more input/output devices, such as a display, akeyboard and/or a mouse, and/or one or more memories, such as staticrandom access memory, dynamic random access memory, flash memory, and/ora hard drive. For example, a display may be employed to display one ormore queries, such as those that may be interrelated, and or one or moretree expressions, although, again, the claimed subject matter is notlimited in scope to this example.

In the preceding description, various aspects of the claimed subjectmatter have been described. For purposes of explanation, specificnumbers, systems and/or configurations were set forth to provide athorough understanding of the claimed subject matter. However, it shouldbe apparent to one skilled in the art having the benefit of thisdisclosure that the claimed subject matter may be practiced without thespecific details. In other instances, well-known features were omittedand/or simplified so as not to obscure the claimed subject matter. Whilecertain features have been illustrated and/or described herein, manymodifications, substitutions, changes and/or equivalents will now occurto those skilled in the art. It is, therefore, to be understood that theappended claims are intended to cover all such modifications and/orchanges as fall within the true spirit of the claimed subject matter.

1-170. (canceled)
 171. A method comprising: accessing instructions fromone or more physical memory devices for execution by one or moreprocessors; executing the instructions accessed from the one or morephysical memory devices by the one or more processors; storing, in atleast one of the physical memory devices, signal values resulting fromhaving executed the accessed instructions on the one or more processors;and tagging subtree structures of a data representation for nodetraversal, wherein tagging comprises: associating signal values with thecorresponding subtree structures; identifying a sequential order oftraversal for a selected group of nodes of a subtree structure of thedata representation, the selected group of nodes to be labeled withsequential signal values corresponding to the sequential order oftraversal; and attaching respective labeled edges and respectivesupporting nodes to the selected group of nodes.
 172. The method ofclaim 171, further comprising: executing the accessed instructions totraverse nodes of the data representation, wherein the datarepresentation is a complex tree hierarchy.
 173. The method of claim171, wherein the signal values comprise: numerical signal values, andwherein the sequential order of traversal comprises a sequentialnumerical order of traversal.
 174. The method of claim 171, wherein thesignal values comprise: character signal values, and wherein thesequential order of traversal comprises a sequential character order oftraversal.
 175. The method of claim 171, wherein the executing thetagging further comprises: attaching respective subtree structures withedges labeled with specific content to the respective supporting nodes.176. The method of claim 175, wherein the respective subtree structuresare selected to be attached based at least in part on the sequentialsignal value of nodes of the selected group of nodes and thecorresponding subtree structure associated therewith.
 177. The method ofclaim 176, wherein the tagging further comprises: traversing theselected group of nodes in the sequential order indicated by theattached respective subtree structures.
 178. The method of claim 177,wherein the tagging further comprises: locating the edges labeled withthe specific content of the respective subtree structures.
 179. Anapparatus comprising: one or more processors coupled to one or morephysical memory devices to store executable instructions and to storedigital signal quantities as physical memory states, wherein theexecutable instructions being accessible from the one or more physicalmemory devices for execution by the one or more processors; and the oneor more processors able to store in at least one of the physical memorydevices, binary signal quantities, if any, that are to result fromexecution of the instructions on the one or more processors, and tagsubtree structures of a data representation for node traversal to:associate signal values with the corresponding subtree structures;identify a sequential order of traversal for a selected group of nodesof a subtree structure of the data representation, the selected group ofnodes to be labeled with sequential signal values corresponding to thesequential order of traversal; and attach respective labeled edges andrespective supporting nodes to the selected group of nodes.
 180. Theapparatus of claim 179, wherein the signal values comprise: one ofnumerical signal values and character signal values, and wherein thesequential order of traversal comprises one of a sequential numericalorder when the signal values comprise numerical signal values, or asequential character order of traversal when the signal values comprisecharacter signal values.
 181. The apparatus of claim 179, wherein to tagsubtree structures for node traversal further to: attach respectivesubtree structures with edges labeled with specific content to therespective supporting nodes.
 182. The apparatus of claim 181, whereinthe respective subtree structures are selected to be attached based atleast in part on the sequential signal value of nodes of the selectedgroup of nodes and the corresponding subtree structure associatedtherewith.
 183. The apparatus of claim 182, wherein the one or moreprocessors are able to tag the subtree structures of the datarepresentation for node traversal further to: traverse the selectedgroup of nodes in the sequential order indicated by attached respectivesubtree structures.
 184. The apparatus of claim 183, wherein the one ormore processors are able to tag the subtree structures of the datarepresentation for node traversal further to: locate the edges labeledwith specific content of the respective subtree structures.
 185. Anarticle comprising: a non-transitory storage medium including executableinstructions stored thereon; wherein the instructions are executable byone or more processors to be coupled to one or more physical memorydevices, the devices to store instructions, including the executableinstructions, and to store binary digital signal quantities as physicalmemory states, wherein the executable instructions to be accessible fromthe one or more physical memory devices for execution by the one or moreprocessors; and wherein the one or more processors are able to store inat least one of the physical memory devices, binary signal quantities,if any, that are to result from execution of the instructions on the oneor more processors, and tag subtree structures of a data representationfor node traversal to: associate numerical values with correspondingsubtree structures; identify a sequential order of traversal for aselected group of nodes of a subtree structure of the datarepresentation, the selected group of nodes to be labeled withsequential signal values corresponding to the sequential order oftraversal; and attach respective labeled edges and respective supportingnodes to the selected group of nodes.
 186. The article of claim 185,wherein the signal values comprise: one of numerical signal values andcharacter signal values, and wherein the sequential order of traversalcomprises one of a sequential numerical order when the signal valuescomprise numerical signal values, or a sequential character order oftraversal when the signal values comprise character signal values. 187.The article of claim 185, wherein to tag subtree structures for nodetraversal further to: attach respective subtree structures with edgeslabeled with specific content to the respective supporting nodes. 188.The article of claim 187, wherein the respective subtree structures areselected to be attached based at least in part on the sequential signalvalue of nodes of the selected group of nodes and the correspondingsubtree structure associated therewith.
 189. The article of claim 188,wherein the one or more processors are able to tag the subtreestructures of the data representation for node traversal further to:traverse the selected group of nodes in the sequential order indicatedby the attached respective subtree structures.
 190. The article of claim189, wherein the one or more processors are able to tag the subtreestructures of the data representation for node traversal further to:locate the edges labeled with the specific content of the respectivesubtree structures.